package src.leetcode.dp.medium_0714;

import javax.sql.rowset.FilteredRowSet;

public class maxProfit {
    public static void main(String[] args) {
        Solution solution = new Solution();
        System.out.println(solution.maxProfit(new int[]{1, 3, 2, 8, 4, 9}, 2));
    }
}


class Solution {
    public int maxProfit(int[] prices, int fee) {
        int len = prices.length;
        int [][]dp = new int[len][2];
        dp[0][0] = -prices[0];

        for (int i = 1; i < len; i++) {
            dp[i][0] = Math.max(dp[i - 1][0], dp[i - 1][1] -prices[i]);
            dp[i][1] = Math.max(dp[i - 1][1], dp[i - 1][0] + prices[i] - fee);
        }

        return Math.max(dp[len - 1][0], dp[len - 1][1]);
    }
}

